n = int(input())
for i in range(2,10**6):
while(n%i**2 == 0):
n //= i
print(n) #include <iostream>
#include <bits/stdc++.h>
#define loop(n) for(int i=0;i<n;i++)
#define ci(n) cin>>n
#define endl '\n'
#define ll long long
int freq[1000001]={};
using namespace std ;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin>>n;
vector<ll>v;
for(int i=1;i<=sqrt(n);i++)
{
if(n%i==0){
v.push_back(i);
if(i!=sqrt(n))v.push_back(n/i);
}
}
sort(v.begin(),v.end(),greater<ll>());
int p =v.size();
for(int i=0;i<p;i++){
bool flag =true;
for(int j=0;j<p;j++){
if(v[i]%v[j]==0){
ll g=sqrt(v[j]);
if(g*g==v[j]&&v[j]!=1)flag=false;
}
}
if(flag){
cout<<v[i];
return 0;
}
}
}
62. Unique Paths | 50. Pow(x, n) |
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |
127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |
60. Permutation Sequence | 42. Trapping Rain Water |
32. Longest Valid Parentheses | Cutting a material |
Bubble Sort | Number of triangles |
AND path in a binary tree | Factorial equations |
Removal of vertices | Happy segments |